Search results for "Metric dimension"

showing 10 items of 11 documents

Isoperimetric inequality via Lipschitz regularity of Cheeger-harmonic functions

2014

Abstract Let ( X , d , μ ) be a complete, locally doubling metric measure space that supports a local weak L 2 -Poincare inequality. We show that optimal gradient estimates for Cheeger-harmonic functions imply local isoperimetric inequalities.

Applied MathematicsGeneral Mathematics010102 general mathematicsMathematical analysista111Poincaré inequalityIsoperimetric dimensionSpace (mathematics)Lipschitz continuity01 natural sciencesMeasure (mathematics)symbols.namesakeHarmonic function0103 physical sciencesMetric (mathematics)symbolsMathematics::Metric Geometry010307 mathematical physics0101 mathematicsIsoperimetric inequalityMathematicsJournal de Mathématiques Pures et Appliquées
researchProduct

Neighbor-Distinguishing k-tuple Edge-Colorings of Graphs

2009

AbstractThis paper studies proper k-tuple edge-colorings of graphs that distinguish neighboring vertices by their sets of colors. Minimum numbers of colors for such colorings are determined for cycles, complete graphs and complete bipartite graphs. A variation in which the color sets assigned to edges have to form cyclic intervals is also studied and similar results are given.

Circular coloringComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION0102 computer and information sciences[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]01 natural sciencesGraphTheoretical Computer ScienceCombinatoricsGreedy coloringIndifference graphChordal graphDiscrete Mathematics and Combinatorics0101 mathematicsFractional coloringComputingMilieux_MISCELLANEOUSComputingMethodologies_COMPUTERGRAPHICSMathematicsDiscrete mathematicsk-tuple edge-coloringClique-sum010102 general mathematics[ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM]1-planar graphMetric dimension010201 computation theory & mathematicsIndependent setMaximal independent setNeighbor-distinguishingMathematicsofComputing_DISCRETEMATHEMATICSAdjacent vertex-distinguishing
researchProduct

On the chromatic number of disk graphs

1998

Colorings of disk graphs arise in the study of the frequency-assignment problem in broadcast networks. Motivated by the observations that the chromatic number of graphs modeling real networks hardly exceeds their clique number, we examine the related properties of the unit disk (UD) graphs and their different generalizations. For all these graphs including the most general class of the double disk (DD) graphs, it is shown that X(G) ≤ c.ω(G) for a constant c. Several coloring algorithms are analyzed for disk graphs, aiming to improve the bounds on X(G). We find that their worst-case performance expressed in the number of used colors is indeed reached in some instances.

Clique-sumComputer Networks and CommunicationsTrapezoid graph1-planar graphMetric dimensionCombinatoricsIndifference graphPathwidthHardware and ArchitectureChordal graphMaximal independent setSoftwareMathematicsofComputing_DISCRETEMATHEMATICSInformation SystemsMathematicsNetworks
researchProduct

Some properties of vertex-oblique graphs

2016

The type t G ( v ) of a vertex v ? V ( G ) is the ordered degree-sequence ( d 1 , ? , d d G ( v ) ) of the vertices adjacent with v , where d 1 ? ? ? d d G ( v ) . A graph G is called vertex-oblique if it contains no two vertices of the same type. In this paper we show that for reals a , b the class of vertex-oblique graphs G for which | E ( G ) | ? a | V ( G ) | + b holds is finite when a ? 1 and infinite when a ? 2 . Apart from one missing interval, it solves the following problem posed by Schreyer et?al. (2007): How many graphs of bounded average degree are vertex-oblique? Furthermore we obtain the tight upper bound on the independence and clique numbers of vertex-oblique graphs as a fun…

Discrete mathematicsClique-sumNeighbourhood (graph theory)020206 networking & telecommunications0102 computer and information sciences02 engineering and technology01 natural sciencesTheoretical Computer ScienceMetric dimensionCombinatoricsIndifference graphNew digraph reconstruction conjecture010201 computation theory & mathematicsChordal graphIndependent set0202 electrical engineering electronic engineering information engineeringDiscrete Mathematics and CombinatoricsBound graphirregular graphsindependence numbervertex-oblique graphslexicographic productMathematicsDiscrete Mathematics
researchProduct

The isoperimetric inequality and the geodesic spheres. Some geometric consequences

1986

Geodesic domeGeodesiclawComplex projective spaceMathematical analysisSPHERESRiemannian manifoldIsoperimetric inequalityIsoperimetric dimensionMathematicslaw.invention
researchProduct

Isoperimetric inequality from the poisson equation via curvature

2012

In this paper, we establish an isoperimetric inequality in a metric measure space via the Poisson equation. Let (X,d,μ) be a complete, pathwise connected metric space with locally Ahlfors Q-regular measure, where Q > 1, that supports a local L2-Poincare inequality. We show that, for the Poisson equation Δu = g, if the local L∞-norm of the gradient Du can be bounded by the Lorentz norm LQ,1 of g, then we obtain an isoperimetric inequality and a Sobolev inequality in (X,d,μ) with optimal exponents. By assuming a suitable curvature lower bound, we establish such optimal bounds on . © 2011 Wiley Periodicals, Inc.

Hölder's inequalityApplied MathematicsGeneral Mathematicsta111Mathematical analysisPoincaré inequalityIsoperimetric dimensionMinkowski inequalitySobolev inequalityMetric spacesymbols.namesakesymbolsLog sum inequalityIsoperimetric inequalityMathematicsCommunications on Pure and Applied Mathematics
researchProduct

Differentiability of the isoperimetric profile and topology of analytic Riemannian manifolds

2012

Abstract We show that smooth isoperimetric profiles are exceptional for real analytic Riemannian manifolds. For instance, under some extra assumptions, this can happen only on topological spheres. To cite this article: R. Grimaldi et al., C. R. Acad. Sci. Paris, Ser. I 347 (2009).

Mathematics - Differential GeometryIsoperimetric dimensionRiemannian geometryTopology01 natural sciencessymbols.namesakeRicci-flat manifoldFOS: MathematicsDifferentiable functionMorse theory0101 mathematicsTopology (chemistry)Computer Science::DatabasesIsoperimetric inequalityMorse theoryMathematicsRiemann surface010102 general mathematicsGeneral Medicinecalibration53C20;49Q20;14P15;32B20010101 applied mathematicsDifferential Geometry (math.DG)Riemann surface[MATH.MATH-DG]Mathematics [math]/Differential Geometry [math.DG]symbolsMathematics::Differential GeometryIsoperimetric inequality
researchProduct

Fl�chen Beschr�nkter Mittlerer Kr�mmung in Einer Dreidimensionalen Riemannschen Mannigfaltigkeit

1973

In recent papers HILDEBRANDT [11] and HARTH [5] proved the existence of solutions of the problem of Plateau for surfaces of bounded mean curvature with fixed and free boundaries in E3 and for minimal surfaces with free boundaries in a Riemannian manifold, respectively. Here their methods will be combined to solve the problem of Plateau for surfaces of bounded mean curvature in a Riemannian manifold. This will be done for fixed and free boundaries. Moreover, isoperimetric inequalities for the solutions will be given.

Mean curvature flowMean curvatureMinimal surfaceGeneral MathematicsPrescribed scalar curvature problemMathematical analysisMathematics::Differential GeometryIsoperimetric dimensionRiemannian manifoldRicci curvatureMathematicsScalar curvatureManuscripta Mathematica
researchProduct

Remark on a nonlocal isoperimetric problem

2017

Abstract We consider isoperimetric problem with a nonlocal repulsive term given by the Newtonian potential. We prove that regular critical sets of the functional are analytic. This optimal regularity holds also for critical sets of the Ohta–Kawasaki functional. We also prove that when the strength of the nonlocal part is small the ball is the only possible stable critical set.

Newtonian potentialcritical pointsApplied Mathematics010102 general mathematicsMathematical analysista111Isoperimetric dimension01 natural sciences010101 applied mathematicsMathematics - Analysis of PDEsshape optimizationFOS: Mathematicsisoperimetric problemShape optimizationBall (mathematics)0101 mathematicsIsoperimetric inequalityAnalysisCritical setAnalysis of PDEs (math.AP)MathematicsNonlinear Analysis: Theory, Methods and Applications
researchProduct

Bonnesenʼs inequality for John domains in Rn

2012

Abstract We prove sharp quantitative isoperimetric inequalities for John domains in R n . We show that the Bonnesen-style inequalities hold true in R n under the John domain assumption which rules out cusps. Our main tool is a proof of the isoperimetric inequality for symmetric domains which gives an explicit estimate for the isoperimetric deficit. We use the sharp quantitative inequalities proved in Fusco et al. (2008) [7] and Fuglede (1989) [4] to reduce our problem to symmetric domains.

Pure mathematicsJohn domainInequalitymedia_common.quotation_subjectMathematical analysisIsoperimetric dimensionQuasiconformal mapDomain (mathematical analysis)Quantitative isoperimetric inequalityMathematics::Metric GeometryIsoperimetric inequalityAnalysismedia_commonMathematicsJournal of Functional Analysis
researchProduct